Low-Order Preconditioning for the High-Order Finite Element de Rham Complex

نویسندگان

چکیده

In this paper we present a unified framework for constructing spectrally equivalent low-order-refined discretizations the high-order finite element de Rham complex. This theory covers diffusion problems in $H^1$, $H({\rm curl})$, and div})$, is based on combining low-order discretization posed refined mesh with basis N\'ed\'elec Raviart-Thomas elements that makes use of concept polynomial histopolation (polynomial fitting using prescribed mean values over certain regions). spectral equivalence, coupled algebraic multigrid methods constructed discretization, results highly scalable matrix-free preconditioners full Additionally, new lowest-order (piecewise constant) preconditioner developed interior penalty discontinuous Galerkin (DG) discretizations, which equivalence convergence proofs are provided. all cases, independent degree size; DG methods, they also parameter. These solvers flexible easy to use; any "black-box" can be used create an effective efficient corresponding problem. A number numerical experiments presented, implmentation library MFEM. The theoretical properties these corroborated, flexibility scalability method demonstrated range challenging three-dimensional problems.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Piecewise Bilinear Preconditioning on High-order Finite Element Methods

The bounds of eigenvalues which are independent of both degrees of high-order elements and mesh sizes are shown for the preconditioned system by bilinear elements for the highorder finite elements discretizations applied to a model uniformly elliptic operator.

متن کامل

Piecewise Bilinear Preconditioning of High-order Finite Element Methods

PIECEWISE BILINEAR PRECONDITIONING OF HIGH-ORDER FINITE ELEMENT METHODS SANG DONG KIM Abstract. Bounds on eigenvalues which are independent of both degrees of high-order elements and mesh sizes are shown for the system preconditioned by bilinear elements for high-order finite element discretizations applied to a model uniformly elliptic operator.

متن کامل

Low-Complexity Finite Element Algorithms for the de Rham Complex on Simplices

We combine recently-developed finite element algorithms based on Bernstein polynomials [1, 14] with the explicit basis construction of the finite element exterior calculus [5] to give a family of algorithms for the Rham complex on simplices that achieves stiffness matrix construction and matrix-free action in optimal complexity. These algorithms are based on realizing the exterior calculus base...

متن کامل

A Posteriori Error Estimates for Finite Element Exterior Calculus: The de Rham Complex

Finite element exterior calculus (FEEC) has been developed over the past decade as a framework for constructing and analyzing stable and accurate numerical methods for partial differential equations by employing differential complexes. The recent work of Arnold, Falk, and Winther includes a well-developed theory of finite element methods for Hodge–Laplace problems, including a priori error esti...

متن کامل

High–order Finite Element Methods for the Kuramoto–sivashinsky Equation

Résumé. Nous considérons l’équation de Kuramoto–Sivashinskymunie de conditions aux limites périodiques et d’une donnée initiale. Nous l’approchons en utilisant une méthode d’éléments finis de type Galerkin pour la discrétisation en espace, et un schéma de Runge–Kutta implicite pour la discrétisation en temps. Nous obtenons des estimations d’erreur optimales et discutons de la linéarisation de c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Scientific Computing

سال: 2023

ISSN: ['1095-7197', '1064-8275']

DOI: https://doi.org/10.1137/22m1486534